A Rate for the Erdös-Turán Law

نویسندگان

  • Andrew D. Barbour
  • Simon Tavaré
چکیده

The Erdős-Turán law gives a normal approximation for the order of a randomly chosen permutation of n objects. In this paper, we provide a sharp error estimate for the approximation, showing that, if the mean of the approximating normal distribution is slightly adjusted, the error is of order log−1/2n. Combinatorics, Probability and Computing (1994) 3, 167-176 Copyright

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analytic Erdös-Turán conjectures and Erdös-Fuchs theorem

We consider and study formal power series, that we call supported series, with real coefficients which are either zero or bounded below by some positive constant. The sequences of such coefficients have a lot of similarity with sequences of natural numbers considered in additive number theory. It is this analogy that we pursue, thus establishing many properties and giving equivalent statements ...

متن کامل

The Graham Conjecture Implies the Erdös-turán Conjecture

Erdös and Turán once conjectured that any set A ⊂ N with

متن کامل

On Fundamental Functions of Lagrangean Interpolation

Erdös and Turán* proved important properties of the interpolating polynomial for the case when the zeros of 0„(x) are taken for abscissas of interpolation . The theorems so deduced enabled the authors cited to draw important conclusions concerning the distribution of the roots of orthogonal polynomials . The proofs of Erdös and Turin are based on some properties of the fundamental functions of ...

متن کامل

A Ramsey-type problem and the Turán numbers

For each n and k, we examine bounds on the largest number m so that for any k-coloring of the edges of Kn there exists a copy of Km whose edges receive at most k − 1 colors. We show that for k ≥ √ n+ Ω(n), the largest value of m is asymptotically equal to the Turán number t(n, b ( n 2 ) /kc), while for any constant > 0, if k ≤ (1 − ) √ n then the largest m is asymptotically larger than that Tur...

متن کامل

The Graph Theory Bibliography

who died after a long illness in his 66th year on 26 September 1976 His death represents an irreplaceable loss to the world of mathematics .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Combinatorics, Probability & Computing

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1994